A mesh refinement method for $Ax=\lambda Bx$
نویسندگان
چکیده
منابع مشابه
A Mesh Refinement Method for Ax = \ Bx
The aim of this paper is to introduce a simple but efficient mesh refinement strategy for use with inverse iteration for finding one or a few solutions of an ordinary or partial differential eigenproblem of the form Ax «■ \Bx. The focus is upon the case where A and B are symmetric and B is positive definite, although the approaches have a very broad application. A discussion of the combined use...
متن کاملA ph mesh refinement method for optimal control
A mesh refinement method is described for solving a continuous-time optimal control problem using collocation at Legendre–Gauss–Radau points. The method allows for changes in both the number of mesh intervals and the degree of the approximating polynomial within a mesh interval. First, a relative error estimate is derived based on the difference between the Lagrange polynomial approximation of ...
متن کاملLocal Mesh Refinement with the PCD Method
We propose some numerical tests for local mesh refinement using the PCD (piecewise constant distributions) method. The PCDmethod is a new discretization technique of boundary value problems. It represents the unknown distribution as well as its derivatives by piecewise constant distributions but on distinct meshes. With the PCDmethod, we can introduce a local mesh refinement without the use of ...
متن کاملDelaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
Creating in parallel guaranteed quality large unstructured meshes is a challenging problem. Parallel mesh generation procedures decompose the original mesh generation problem into smaller subproblems that can be solved in parallel. The subproblems can be treated as either completely or partially coupled, or they can be treated as completely decoupled. In this paper we present a parallel guarant...
متن کاملMiniAMR - A miniapp for Adaptive Mesh Refinement
We present a new implementation of MiniAMR, a miniapp for adaptive mesh refinement (AMR) that mimics commonly found workloads and communication patterns in AMR applications. We obtain significant performance improvements by using new data structures and algorithms. One of our important areas of focus in this work is the use of low-overhead distributed load balancing schemes for octree partition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1981
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1981-0606508-4